package codeRandomThoughts.Test62不同路径;

public class Solution2 {
    public int uniquePaths(int m, int n) {
        //dp[i][j]:机器人到达坐标为(i,j)的位置总共有多少条路线
        int[][] dp = new int[m][n];
        //初始化
        dp[0][0] = 0;
        for (int i = 0; i < m; i++) {
            dp[i][0] = 1;
        }
        for (int j = 0; j < n; j++) {
            dp[0][j] = 1;
        }

        for (int i = 1; i < m; i++) {
            for (int j = 1; j < n; j++) {
                dp[i][j] = dp[i - 1][j] + dp[i][j - 1];
            }
        }

        return dp[m - 1][n - 1];
    }
}
